Expressibility of Properties of Relations
نویسندگان
چکیده
We investigate in an algebraic setting the question in which logical languages the properties integral, permutational, and rigid of algebras of relations can be expressed.
منابع مشابه
Expressibility of Valued Constraints
In this paper we present a project on the expressibility of valued constraints. We recall the result of Cohen et al. [2] which characterises the expressibility of valued constraints in terms of algebraic properties of the constraints. We show why the current algebraic characterisation is rather unsatisfactory and what are the ways we try to explore in order to find a better one.
متن کاملProperties of fuzzy relations and aggregation process in decision making
In this contribution connections between input fuzzy relations R1, . . . ,Rn on a set X and the output fuzzy relationRF = F(R1, . . . ,Rn) are studied. F is a function of the form F : [0, 1]n → [0, 1] and RF is called an aggregated fuzzyrelation. In the literature the problem of preservation, by a function F, diverse types of properties of fuzzy relationsR1, . . . ,Rn is examined. Here, it is c...
متن کاملSubwords and Power-Free Words are not Expressible by Word Equations
We consider several open problems of Karhum aki, Mignosi, and Plandowski, cf. [KMP], concerning the expressibility of languages and relations as solutions of word equations. We show rst that the (scattered) subword relation is not expressible. Then, we consider the set of k-power free nite words and solve it negativelly for all nontrivial integer values of k. Finally, we consider the Fibonacci...
متن کاملOn parametrical expressibility in the free void-generated diagonalizable algebra
Let A be any universal algebra. We say formula A is explicitly expressible on algebra A via system of formulas Σ, if A can be obtained on A of variables and formulas of Σ by means of superpositions. We say a system of formulas Σ is complete in A, if any formula is expressible via Σ. We say a system Σ is precomplete as to expressibility on A if Σ is not complete on A, but for any formula F , whi...
متن کاملLinear vs Polynomial Constraints in Database Query Languages
We prove positive and negative results on the expressive power of the relational calculus augmented with linear constraints. We show non-expressibility of some properties expressed by polynomial constraints. We also show expressibility of some queries involving existence of lines, when the query output has a simple geometrical relation to the input. Finally, we compare the expressive power of l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 60 شماره
صفحات -
تاریخ انتشار 1995